Some Hilbert Space Extremal Problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Hilbert Space Extremal Problems

is achieved. This is given by e¡ = (1 -\-'Kkj)~1hj, where X is the unique positive root of £"-0 kj(l +\k])-1\hj\2 = M2. Davis proved the result by first considering the extremal problem for ra dimensional Euclidean space Rn. In this case the problem has the following geometric interpretation : (a") Let E be the hyperellipse {(oi, • • • , an): ]£?„„ kjOJ^M2} in Rn and suppose that h = (hi, • ■ ■...

متن کامل

Some Extremal Problems in Geometry

Continuing our work of [3] we obtain lower bounds on the number of simplices of different volumes and on the number of hyperplanes determined by n points in Ek , not all of which lie on an Ek-1 and no k of which lie on an Ek-2 . We also determine the minimum number of triangles t determined by n noncollinear points in the plane and discuss what values of t can be achieved . L . M . Kelly and 14...

متن کامل

Equilibrium problems and fixed point problems for nonspreading-type mappings in hilbert space

In this paper by using the idea of mean convergence, weintroduce an iterative scheme for finding a common element of theset of solutions of an equilibrium problem and the fixed points setof a nonspreading-type mappings in Hilbert space. A strongconvergence theorem of the proposed iterative scheme is establishedunder some control conditions. The main result of this paper extendthe results obtain...

متن کامل

Some Extremal Problems for Vector Bundles

Analogs of well-known problems and theorems on convex bodies are considered for the case where the convex bodies are replaced by continuous fields of convex bodies in vector bundles.

متن کامل

SOME EXTREMAL PROBLEMS ON r-GRAPHS

1 . Introduction . By an r-graph we mean a fixed set of vertices together with a class of unordered subsets of this fixed set, each subset containing exactly r elements and called an r-tuple . In the language of Berge [2j this is a simple uniform hypergraph of rank r . The concept becomes interesting only for r > 1 : for r = 2 we obtain ordinary (i .e ., Michigan) graphs . We shall represent an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1965

ISSN: 0002-9939

DOI: 10.2307/2033905